k-Step Sum and m-Step Gap Fibonacci Sequence

The Polytopic-k-Step Fibonacci Sequences in Finite Groups

The Fibonacci Sequence Mod m

We know that ( ) mod n F p forms a periodic sequence (vide Theorem 4). Let ( ) h p denote the length of the sequence. Let p be a prime such that: { } ( ) 2,3 mod 5 p ≡ a sufficient and necessary condition to ensure that ( ) 2 2 h p p + . We shall denote this group 1 G F . Let { } 1, 2 , , k D d d d = be the non-empty set of k divisors of 2 2 p + . Then for ( ) [ ] 1 min G i F h p d = such that ...

On the Maximal Degree of the K-Step Obrechkoff’s Method

MODIFIED K-STEP METHOD FOR SOLVING FUZZY INITIAL VALUE PROBLEMS

We are concerned with the development of a K−step method for the numerical solution of fuzzy initial value problems. Convergence and stability of the method are also proved in detail. Moreover, a specific method of order 4 is found. The numerical results show that the proposed fourth order method is efficient for solving fuzzy differential equations.

k-Step Relative Inductive Generalization

We introduce a new form of SAT-based symbolic model checking. One common idea in SAT-based symbolic model checking is to generate new clauses from states that can lead to property violations. Our previous work suggests applying induction to generalize from such states. While effective on some benchmarks, the main problem with inductive generalization is that not all such states can be inductive...